Finiteness Conditions for Strictness Analysis
نویسندگان
چکیده
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler’s method for analysing lists. Limitations of the method are indicated.
منابع مشابه
The Role of Corporate Governance Mechanisms and the Auditor's Specialty in Debt Contract Strictness
Objective: Violation of contractual conditions leads to the transmission of bad news due to poor performance and the expertise of auditors and regulatory mechanisms can be a factor in adjusting it. In this article, the purpose is to examine the role of strictness in the debt contract and the auditor's expertise. Research Method: In order to study the subject based on the logistic regression mo...
متن کاملProjections for Polymorphic First-Order Strictness Analysis
We apply the categorical properties of polymorphic functions to compile-time analysis, speciically projection-based strictness analysis. First we interpret parameterised types as functors in a suitable category, and show that they preserve monics and epics. Then we deene \strong" and \weak" polymorphism, the latter admitting certain projections that are not polymorphic in the usual sense. We pr...
متن کاملStrictness Analysis via Resource Typing
We present a new typing system for strictness analysis of functional programs. The system extends standard typing (including recursive data types) with strictness annotations and subtyping. Strictness typing is shown to be sound with respect to a natural operational semantics. We demonstrate that strictness types can be computed effectively.
متن کاملStrictness Analysis in Logical Form
y Abstract This paper presents a framework for comparing two strictness analysis techniques: Abstract interpretation and non{standard type inference. The comparison is based on the representation of a lattice by its ideals. A formal system for deducing inclusions between ideals of a lattice is presented and proved sound and complete. Viewing the ideals as strictness properties we use the formal...
متن کاملA Complete Proof of Nöcker’s Strictness Analysis
This paper proves correctness of Nöcker’s method of strictness analysis, implemented in the Clean compiler, which is an effective way for strictness analysis in lazy functional languages based on their operational semantics. We improve upon the work of Clark, Hankin and Hunt did on the correctness of the abstract reduction rules. Our method fully considers the cycle detection rules, which are t...
متن کامل